Between reduced powers and ultrapowers, II.
نویسندگان
چکیده
We prove that, consistently with ZFC, no ultraproduct of countably infinite (or separable metric, non-compact) structures is isomorphic to a reduced product countable metric) associated the Fréchet filter. Since such are saturated, Continuum Hypothesis implies that they when elementarily equivalent.
منابع مشابه
Relations on Iterated Reduced Powers.
* This investigation was supported by a grant from the National Foundation for Infantile Paralysis. I Bertani, G., and Weigle, J., J. Bact., 65, 113 (1953). 2 Adams, M. H., in Methods in Medical Research, Chicago, 1950. 3 Dulbecco, R., J. Bact., 59, 329 (1950). 4 Jacob, F., personal communication. 6 We wish to thank Ciba S.A., Basel, Switzerland, who put at our disposal the chlorohydrate of met...
متن کاملBoolean Ultrapowers, the Bukovský-dehornoy Phenomenon, and Iterated Ultrapowers
We show that while the length ω iterated ultrapower by a normal ultrafilter is a Boolean ultrapower by the Boolean algebra of Př́ıkrý forcing, it is consistent that no iteration of length greater than ω (of the same ultrafilter and its images) is a Boolean ultrapower. For longer iterations, where different ultrafilters are used, this is possible, though, and we give Magidor forcing and a general...
متن کاملCycle bases of reduced powers of graphs
We define what appears to be a new construction. Given a graph G and a positive integer k, the reduced kth power of G, denoted G, is the configuration space in which k indistinguishable tokens are placed on the vertices of G, so that any vertex can hold up to k tokens. Two configurations are adjacent if one can be transformed to the other by moving a single token along an edge to an adjacent ve...
متن کاملDifferences between Perfect Powers
We apply the hypergeometric method of Thue and Siegel to prove, if a and b are positive integers, that the inequality 0 < |a − b | < 1 4 max{a, b} has at most a single solution in positive integers x and y. This essentially sharpens a classic result of LeVeque.
متن کاملFresh subsets of ultrapowers
In [8], Shelah and Stanley constructed a κ-Aronszjan tree with an ascent path using κ. We show that κ,2 does not imply the existence of Aronszajn trees with ascent paths. The proof goes through an intermediate combinatorial principle, which we investigate further.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2022
ISSN: ['2330-0000']
DOI: https://doi.org/10.1090/tran/8777